Schur numbers and the ramsey numbers N(3, 3,…, 3; 2)
نویسندگان
چکیده
منابع مشابه
Zarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملA Lower Bound for Schur Numbers and Multicolor Ramsey Numbers
For k ≥ 5, we establish new lower bounds on the Schur numbers S(k) and on the k-color Ramsey numbers of K3. For integers m and n, let [m,n] denote the set {i |m ≤ i ≤ n}. A set S of integers is called sum-free if i, j ∈ S implies i + j 6∈ S, where we allow i = j. The Schur function S(k) is defined for all positive integers as the maximum n such that [1, n] can be partitioned into k sum-free set...
متن کامل3-colored Ramsey Numbers of Odd Cycles
Recently we determined the Ramsey Number r(C7, C7, C7) = 25. Let G = (V (G), E(G)) be an undirected finite graph without any loops or multiple edges, where V (G) denotes its vertex set and E(G) its edge set. In the following we will often consider the complete graph Kp on p vertices and the cycle Cp on p vertices. A k−coloring (F1, F2, . . . , Fk) of a graph G is a coloring of the edges of G wi...
متن کاملRefined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three
Let P denote a 3-uniform hypergraph consisting of 7 vertices a, b, c, d, e, f , g and 3 edges {a, b, c}, {c, d, e}, and {e, f , g}. It is known that the r-color Ramsey number for P is R(P; r) = r + 6 for r ⩽ 7. The proof of this result relies on a careful analysis of the Turán numbers for P . In this paper, we refine this analysis further and compute, for all n, the third and fourth order Turán...
متن کاملMulticolor Ramsey Numbers and Restricted Turán Numbers for the Loose 3-Uniform Path of Length Three
Let P denote a 3-uniform hypergraph consisting of 7 vertices a, b, c, d, e, f, g and 3 edges {a, b, c}, {c, d, e}, and {e, f, g}. It is known that the r-colored Ramsey number for P is R(P ; r) = r + 6 for r = 2, 3, and that R(P ; r) 6 3r for all r > 3. The latter result follows by a standard application of the Turán number ex3(n;P ), which was determined to be ( n−1 2 ) in our previous work. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1979
ISSN: 0097-3165
DOI: 10.1016/0097-3165(79)90028-1